7.14 Rewrite heapsort so that it sorts only items that are in the range low to high which are passed as additional parameters. Solution: If the root is stored in position low, then the left child of node i is stored at position 2i + 1 - low. This requires a small change to the heapsort code. | |
| View Solution | |
| << Back | Next >> |